Integrating advanced discrete choice models in mixed integer linear optimization
نویسندگان
چکیده
In many transportation systems, a mismatch between the associated design and planning decisions demand is typically encountered. A tailored system not only appealing to operators, which could have better knowledge of their operational costs, but also users, since they would benefit from an increase in level service satisfaction. Hence, it important explicitly allow for interactions two model governing system. Discrete choice models (DCM) provide disaggregate representation that able capture impact on behavior these by taking into account heterogeneity tastes preferences as well subjective aspects related attitudes or perceptions. Despite advantages, expressions derived DCM are non-linear non-convex explanatory variables, restricts integration optimization problems. this paper, we overcome probabilistic nature relying simulation order specify directly terms utility functions (instead probabilities). This allows us define mixed-integer linear formulation characterizes preference structure behavioral assumption DCM, can then be embedded programming (MILP) model. We overview extent framework with illustrative MILP designed solve profit maximization problem parking services operator. The obtained results show potential proposed methodology adjust supply-related users.
منابع مشابه
The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
We propose a new high-dimensional linear regression estimator: the Discrete Dantzig Selector, which minimizes the number of nonzero regression coefficients, subject to a budget on the maximal absolute correlation between the features and residuals. We show that the estimator can be expressed as a solution to a Mixed Integer Linear Optimization (MILO) problem, a computationally tractable framewo...
متن کاملParallel Solvers for Mixed Integer Linear Optimization
In this article, we provide an overview of the current state of the art with respect to solution of mixed integer linear optimization problems (MILPS) in parallel. Sequential algorithms for solving MILPs have improved substantially in the last two decades and commercial MILP solvers are now considered effective off-the-shelf tools for optimization. Although concerted development of parallel MIL...
متن کاملTrajectory Optimization using Mixed-Integer Linear Programming
This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of decisions about terminal constraints in the optimization, such as assignment of waypoints to UAVs and the ...
متن کاملInteger convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملPredictive route choice control of destination coded vehicles with mixed integer linear programming optimization
State-of-the-art baggage handling systems transport luggage in an automated way using destination coded vehicles (DCVs). These vehicles transport the bags at high speeds on a “mini” railway network. In this paper we consider the problem of controlling the route of each DCV in the system. This is a nonlinear, nonconvex, mixed integer optimization problem. Nonlinear model predictive control (MPC)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B-methodological
سال: 2021
ISSN: ['1879-2367', '0191-2615']
DOI: https://doi.org/10.1016/j.trb.2021.02.003